A Note on Authentication Codes
نویسندگان
چکیده
In this short note we show that the bound provided by Theorem 3.8 in 4] is not correct by exhibiting a counter example. We identify the aw in the proof of Theorem 3.8 in 4] and then we prove a correct bound on P S .
منابع مشابه
Efficiency of Anti-Hourglassing Approaches in Finite Element Method (TECHNICAL NOTE)
one of the simplest numerical integration method which provides a large saving in computational efforts, is the well known one-point Gauss quadrature which is widely used for 4 nodes quadrilateral elements. On the other hand, the biggest disadvantage to one-point integration is the need to control the zero energy modes, called hourglassing modes, which arise. The efficiency of four different an...
متن کاملLinear Authentication Codes from Free Modules: Bounds and Constructions
In this paper, we principally introduce a new class of unconditionally secure authentication codes, called linear authentication codes(or linear A-codes)from free modules. We then derive an upper bound on the size of source space when other parameters of the system, that is, the sizes of the key space and authenticator space, and the deception probability are fixed. We give constructions that a...
متن کاملA note on the security of two improved RFID protocols
Recently, Baghery et al. [1, 2] presented some attacks on two RFID protocols, namely Yoon and Jung et al. protocols, and proposed the improved version of them. However, in this note, we show that the improved version of the Jung et al. protocol suffers from desynchronization attack and the improved version of the Yoon's protocol suffers from secret disclosure attack. The succe...
متن کاملCombinatorial Bounds on Authentication Codes with Arbitration
Unconditionally secure authentication codes with arbitration (A 2-codes) protect against deceptions from the transmitter and the receiver as well as that from the opponent. In this paper, we present combinatorial lower bounds on the cheating probabilities and the sizes of keys of A 2-codes. Especially, our bounds for A 2-codes without secrecy are all tight for small size of source states.
متن کاملSecure Image Encryption Authentication Compression System
A two-phase content-based image authentication scheme is constructed based on a combination of hard and soft authentication implementing previous existing generic approximate message authentication codes which is a error-correcting codes with cryptographic message authentication codes and symmetric encryption techniques. The message authentication codes which used for hard authentication. The t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998